Diversification-driven tabu search for unconstrained binary quadratic problems
نویسندگان
چکیده
منابع مشابه
Diversification-driven tabu search for unconstrained binary quadratic problems
This paper describes a Diversification-Driven Tabu Search (D2TS) algorithm for solving unconstrained binary quadratic problems. D2TS is distinguished by the introduction of a perturbation-based diversification strategy guided by longterm memory. The performance of the proposed algorithm is assessed on the largest instances from theORLIB library (up to 2500 variables) as well as still larger ins...
متن کاملIterated Tabu Search for the Unconstrained Binary Quadratic Optimization Problem
Given a set of objects with profits (any, even negative, numbers) assigned not only to separate objects but also to pairs of them, the unconstrained binary quadratic optimization problem consists in finding a subset of objects for which the overall profit is maximized. In this paper, an iterated tabu search algorithm for solving this problem is proposed. Computational results for problem instan...
متن کاملNeighborhood Combination for Unconstrained Binary Quadratic Problems
We present an experimental analysis of neighborhood combinations for local search based metaheuristic algorithms, using the Unconstrained Binary Quadratic Programming (UBQP) problem as a case study. The goal of the analysis is to help understand why, when and how some neighborhoods can be favorably combined to increase their search power. Our study investigates combined neighborhoods with two t...
متن کاملRobust Optimization of Unconstrained Binary Quadratic Problems
In this paper we focus on the unconstrained binary quadratic optimization model, maximize xQx, x binary, and consider the problem of identifying optimal solutions that are robust with respect to perturbations in the Q matrix.. We are motivated to find robust, or stable, solutions because of the uncertainty inherent in the big data origins of Q and limitations in computer numerical precision, pa...
متن کاملOne-pass heuristics for large-scale unconstrained binary quadratic problems
Many significant advances have been made in recent years for solving unconstrained binary quadratic programs (UQP). As a result, the size of problem instances that can be efficiently solved has grown from a hundred or so variables a few years ago to two or three thousand variables today. These advances have motivated new applications of the model which, in turn, have created the need to solve e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: 4OR
سال: 2010
ISSN: 1619-4500,1614-2411
DOI: 10.1007/s10288-009-0115-y